Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Mars 201 4 Optimal stock - out risk for a component mounted on several assembly lines in the case of emergency supplies

نویسندگان

  • Mustapha Sali
  • CAHIER DU
چکیده

This article examines the optimal stock-out risk for a component used by alternative modules mounted on several assembly lines. The studied context is a supply chain dedicated to the mass production of highly diversified products, which is common in the automotive industry. The material requirement planning (MRP) approach is adapted to monitor this chain; however, the distance between the production units leads to a mix between production to stock and production to order for the component of interest. To prevent stock-out propagation along the downstream part of the supply chain, the requirement for an emergency supply is triggered prior to the latter’s occurrence. The definition of the optimal safety stock and its associated optimal stock-out risk are based on a mono-period model that considers the cost of a safety stock and the costs incurred by the emergency supply (transportation and production). The analytical solutions dependent on these costs are illustrated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laboratoire d ’ Analyse et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 201 5 On social rankings and their properties

Several real-life complex systems, like human societies or economic networks, are formed by interacting units characterized by patterns of relationships that may generate a group-based social hierarchy. In this paper, we address the problem of how to rank the individuals with respect to their ability to “influence” the relative strength of groups in a society. We also analyse the effect of basi...

متن کامل

Laboratoire d ’ Analyses et Modélisation de Systèmes pour l ’ Aide à la Décision UMR 7243 Décembre 2012 A note on Using T - joins to Approximate Solutions for CAHIER DU 32 9

We consider a generalized Path Traveling Salesman Problem where the distances are defined by a 2-edge-connected graph metric and a constant number of salesmen have to cover all the destinations by traveling along paths of minimum total length. We show that for this problem there is a polynomial algorithm with asymptotic approximation ratio of 2 .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014